Sequentially rationalizable choice with transitive rationales
نویسندگان
چکیده
Article history: Received 4 October 2010 Available online 18 February 2011
منابع مشابه
Rationalizing Boundedly Rational Choice: Sequential Rationalizability and Rational Shortlist Methods
Rationalizing Boundedly Rational Choice: Sequential Rationalizability and Rational Shortlist Methods A sequentially rationalizable choice function is a choice function which can be obtained by applying sequentially a fixed set of asymmetric binary relations (rationales). A Rational ShortlistMethod (RSM) is a choice function which is sequentially rationalizable by two rationales. These concepts ...
متن کاملA simple model of two-stage choice
I provide choice-theoretic foundations for a simple two-stage model, called transitive shortlist methods, where choices are made by sequentially by applying a pair of transitive preferences (or rationales) to eliminate inferior alternatives. Despite its simplicity, the model accommodates a wide range of choice phenomena including the status quo bias, framing, homophily, compromise, and limited ...
متن کاملCentre de Referència en Economia Analítica
A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability. F-consistency is a testable property that highlights the behavioral aspects implicit in sequentially rat...
متن کاملRational Choice: the Case of Path Dependent Procedures
Describing a procedure in which choice proceeds in a sequence, we propose two alternatives ways of resolving the decision problem whenever the outcome is sequence-sensitive. One way yields a rationalizable choice set, and the other way produces a weakly rationalizable choice set that is equivalent to von Neumann-Morgenstern's stable set. It is shown that for quasi-transitive rationalization, th...
متن کاملThe Satisfiability Problem for Boolean Set Theory with a Choice Correspondence
Given a setU of alternatives, a choice (correspondence) onU is a contractive map c defined on a family Ω of nonempty subsets ofU . Semantically, a choice c associates to each menu A ∈ Ω a nonempty subset c(A) ⊆ A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty set, and partial otherwise. According to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 73 شماره
صفحات -
تاریخ انتشار 2011